Circular Antenna Array Design by Using Evolutionary Search Algorithms

نویسنده

  • Pinar Civicioglu
چکیده

Evolutionary Search Algorithms (EA) have been intensively used in solving numerical optimization problems. Since design of antenna arrays is a numerical optimization problem, EAs have been intensively used in solving antenna arrays design problems. Although EAs are widely used in antenna array design problems, a performance comparison study of the intensively used EAs for circular antenna array design problem has been scarcely studied. In this paper, 3 different circular antenna array design problems have been solved by using 15 different evolutionary search algorithms (i.e., ABC, ACS, BSA, CK, CLPSO, CMAES, DE, E2-DSA, EPSDE, GSA, JADE, JDE, PSO, SADE, S-DSA). The objective function designed for solution of the relevant circular antenna array design problems ensures minimization of side lobe levels, acquisition of maximum directivity, and null control of the non-uniform, planar circular antenna array. Obtained statistical analysis results show that S-DSA solves the relevant circular antenna array design problems statistically better than the other evolutionary algorithms used in this paper.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Circularly Polarized Circular Slot Antenna Array Using Sequentially Rotated Feed Network

This paper presents the design, simulation, and measurement of two low-cost broadband circularly polarized (CP) printed antennas: a single element and an array at C band. The proposed single element antenna is excited by an L-shaped strip with a tapered end, located along the circular-slot diagonal line in the back plane. From the array experimental results, the 3 dB axial ratio bandwidth can r...

متن کامل

Digitally Excited Reconfigurable Linear Antenna Array Using Swarm Optimization Algorithms

This paper describes the synthesis of digitally excited pencil/flat top dual beams simultaneously in a linear antenna array constructed of isotropic elements. The objective is to generate a pencil/flat top beam pair using the excitations generated by the evolutionary algorithms. Both the beams share common variable discrete amplitude excitations and differ in variable discrete phase excitations...

متن کامل

A Thinning Method of Linear And Planar Array Antennas To Reduce SLL of Radiation Pattern By GWO And ICA Algorithms

In the recent years, the optimization techniques using evolutionary algorithms have been widely used to solve electromagnetic problems. These algorithms use thinning the antenna arrays with the aim of reducing the complexity and thus achieving the optimal solution and decreasing the side lobe level. To obtain the optimal solution, thinning is performed by removing some elements in an array thro...

متن کامل

Design and Fabrication of Plasma Array Antenna with Beam Forming

In this paper, the design and implementation of plasma antenna array with beam forming is discussed. The structure consists of a circular array of plasma tube enclosed in a unipolar UHF band monopole antenna. Beam forming is possible by stimulated plasma tubes. The combination of the above antenna with plasma excitation controller makes a beam forming smart antenna. An experimental model in UHF...

متن کامل

Comparison of Evolutionary Optimization Algorithms for FM-TV Broadcasting Antenna Array Null Filling n

Broadcasting antenna array null filling is a very challenging problem for antenna design optimization. This paper compares five antenna design optimization algorithms (Differential Evolution, Particle Swarm, Taguchi, Invasive Weed, Adaptive Invasive Weed) as solutions to the antenna array null filling problem. The algorithms compared are evolutionary algorithms which use mechanisms inspired by ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013